Solving Unconstrained Optimization Problems with Some Three-term Conjugate Gradient Methods

In this paper, based on the efficient Conjugate Descent ({\tt CD}) method, two generalized {\tt CD}algorithms are proposed to solve unconstrained optimization problems.These methods three-term conjugate gradient which generateddirections by using parameters and independent of line searchsatisfy in sufficient descent condition. Furthermore, under strong Wolfe search,the global convergence proved. Also, preliminary numericalresults CUTEst} collection presented show effectiveness our methods.